Friedberg numbering in fragments of Peano Arithmetic and α-recursion theory
نویسنده
چکیده
In this paper, we investigate the existence of a Friedberg numbering in fragments of Peano Arithmetic and initial segments of Gödel’s constructible hierarchy Lα, where α is Σ1 admissible. We prove that (1) Over P− +BΣ2, the existence of a Friedberg numbering is equivalent to IΣ2, and (2) For Lα, there is a Friedberg numbering if and only if the tame Σ2 projectum of α equals the Σ2 cofinality of α.
منابع مشابه
Σ2 Induction and Infinite Injury Priority Arguments, Part Iii: Prompt Sets, Minimal Pairs and Shoenfield’s Conjecture
Priority constructions are the trademark of theorems on the recursively enumerable Turing degrees. By their combinatorial patterns, they are naturally identified as finite injury, infinite injury, and so forth. Following Chong and Yang [4], [3], we analyze the complexity of infinite injury arguments and pinpoint exactly the position of their degree-theoretic applications within the hierarchy of...
متن کاملThe Witness Function Method and Provably Recursive Functions of Peano Arithmetic
This paper presents a new proof of the characterization of the provably recursive functions of the fragments IΣn of Peano arithmetic. The proof method also characterizes the Σk -definable functions of IΣn and of theories axiomatized by transfinite induction on ordinals. The proofs are completely proof-theoretic and use the method of witness functions and witness oracles. Similar methods also yi...
متن کاملComplexity and Incompleteness
The theorems of a finitely-specified, sound, consistent theory which is strong enough to include arithmetic have bounded δ-complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. More precisely, according to Theorem 4.6 in [1], for any finitely-specified, sound, consistent theory strong enough to formalize arithmetic (like Zermelo-Fraenk...
متن کاملGödel Numberings versus Friedberg Numberings
In [3], Rogers discussed the concept of Gödel numbering. He defined a semi-effective numbering, constructed a semi-lattice of equivalence classes of semi-effective numberings, and showed that all Gödel numberings belong to the unique maximal element of this semi-lattice. In [l], Friedberg gave a recursive enumeration without repetition of the set of partial recursive functions of a single varia...
متن کاملMass Problems
Informally, mass problems are similar to decision problems. The difference is that, while a decision problem has only one solution, a mass problem is allowed to have more than one solution. Many concepts which apply to decision problems apply equally well to mass problems. For instance, a mass problem is said to be solvable if it has at least one computable solution. Also, one mass problem is s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 78 شماره
صفحات -
تاریخ انتشار 2013